package anthology.daily_question._25_01;
//https://leetcode.cn/problems/minimum-operations-to-exceed-threshold-value-i/description/?envType=daily-question&envId=2025-01-14
public class _3065超过阈值的最少操作数1 {
    class Solution {
        public int minOperations(int[] nums, int k) {
            int tmp = 0;
            for(int i : nums){
                if(k>i){
                    tmp++;
                }
            }
            return tmp;
        }
    }
}
